On Quantization and Communication Topologies in Multi-vehicle Rendezvous
نویسندگان
چکیده
A rendezvous problem for a team of autonomous vehicles that is communicating through quantized channels is considered. Communication topologies and feedback control law are presented that solves the rendezvous problem in the sense that a meeting point for the vehicles is practically stabilized. In particular, it is shown that uniform quantizers can sometimes be replaced by logarithmic quantizers and thus reduce the need for communication bandwidth. Copyright c ©2005 IFAC
منابع مشابه
On Multi-Vehicle Rendezvous Under Quantized Communication
A rendezvous problem for a team of autonomous vehicles, which communicate over quantized channels, is analyzed. The paper illustrates how communication topologies based on uniform and logarithmic quantizations influence the performance. Since a logarithmic quantizer in general imposes fewer bits to be communicated compared to a uniform quantizer, the results indicate estimates of lower limits o...
متن کاملOn Control under Communication Constraints in Autonomous Multi-robot Systems
Multi-robot systems have important applications, such as space explorations, underwater missions, and surveillance operations. In most of these cases robots need to exchange data through communication. Limitations in the communication system however impose constraints on the design of coordination strategies. In this thesis we present three papers on cooperative control problems in which differ...
متن کاملOn the performance of randomized communication topologies for rendezvous control of multiple vehicles
In this paper we analyze randomized coordination control strategies for the rendezvous problem of multiple agents with unknown initial positions. The performance of these control strategies is measured in terms of three important metrics: average relative agents’ distance, total input energy consumption, and number of packets per unit time that each agent can receive from the other agents. By a...
متن کاملOn rendezvous control with randomly switching communication graphs
In this paper we analyze randomized coordination control strategies for the rendezvous problem of multiple agents with unknown initial positions. The performance of these control strategies is measured in terms of three metrics: average relative agents’ distance, total input energy consumption, and number of packets per unit time that each agent can receive from the other agents. By considering...
متن کاملCone Invariance and Rendezvous of Multiple Agents
In this paper we present a dynamical systems framework for analyzing multi-agent rendezvous problems and characterize the dynamical behavior of the collective system. Recently, the problem of rendezvous has been addressed considerably in the graph theoretic framework, which is strongly based on the communication aspects of the problem. The proposed approach is based on set invariance theory and...
متن کامل